Computational Construction of a Maximum Equilateral Triangle Inscribed in an Origami
نویسندگان
چکیده
We present an origami construction of a maximum equilateral triangle inscribed in an origami, and an automated proof of the correctness of the construction. The construction and the correctness proof are achieved by a computational origami system called Eos (E-origami system). In the construction we apply the techniques of geometrical constraint solving, and in the automated proof we apply Gröbner bases theory and the cylindrical algebraic decomposition method. The cylindrical algebraic decomposition is indispensable to the automated proof of the maximality since the specification of this property involves the notion of inequalities. The interplay of construction and proof by Gröbner bases method and the cylindrical algebraic decomposition supported by Eos is the feature of our work.
منابع مشابه
Proof Assistant Decision Procedures for Formalizing Origami
Origami constructions have interesting properties that are not covered by standard euclidean geometry. Such properties have been shown with the help of computer algebra systems. Proofs performed with computer algebra systems can be accompanied by proof documents, still they lack complete mathematical rigorousity, like the one provided by proof assistant checked proofs. Transforming such proofs ...
متن کاملAn Inequality concerning Polyhedra
This is easily established, since according to the theorem of Euler mentioned above, if d denotes the distance between the centers of the circumscribed and inscribed circles, then d = R2rR. It follows that R~2rR^0, and therefore R^2r. Equality holds only if the two circles are concentric, that is, if the triangle is equilateral. The problem of generalizing the above result to space was proposed...
متن کاملNP-Hard Triangle Packing Problems
In computational geometry, packing problems ask whether a set of rigid pieces can be placed inside a target region such that no two pieces overlap. The triangle packing problem is a packing problem that involves triangular pieces, and it is crucial for algorithm design in many areas, including origami design, cutting industries, and warehousing. Previous works in packing algorithms have conject...
متن کاملDiscovering Dependencies: A Case Study of Collaborative Dynamic Mathematics
The Virtual Math Teams (VMT) Project is exploring an approach to the teaching and learning of basic school geometry through a computer-supported collaborative-learning (CSCL) approach. As one phase of a design-based-research cycle of design/trial/analysis, two teams of three adults worked on a dynamic-geometry task in the VMT online environment. The case study presented here analyzes the progre...
متن کاملDegree Four Plane Spanners: Simpler and Better
Let P be a set of n points embedded in the plane, and let C be the complete Euclidean graph whose point-set is P. Each edge in C between two points p, q is realized as the line segment [pq], and is assigned a weight equal to the Euclidean distance |pq|. In this paper, we show how to construct inO(n lgn) time a plane spanner of C of maximum degree at most 4 and of stretch factor at most 20. This...
متن کامل